Root Sets of Polynomials Modulo Prime Powers

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Roots of Polynomials Modulo Prime Powers

To say that R is a root set modulo n means that R is a subset of Z n , the ring of integers modulo n , and there is a polynomial the roots of which modulo n are exactly the elements of R . Note that [ and Z n are always root sets modulo n . It seems that only two papers have appeared which mention the nature of root sets modulo n , and then only at a very basic level : Sierpin ́ ski [3] and Choj...

متن کامل

Congruences modulo Prime Powers

Let p be any prime, and let α and n be nonnegative integers. Let r ∈ Z and f (x) ∈ Z[x]. We establish the congruence p deg f k≡r (mod p α) n k (−1) k f k − r p α ≡ 0 mod p ∞ i=α ⌊n/p i ⌋ (motivated by a conjecture arising from algebraic topology), and obtain the following vast generalization of Lucas' theorem: If α > 1 and l, s, t are nonnegative integers with s, t < p, then 1 ⌊n/p α−1 ⌋! k≡r (...

متن کامل

Exponential Sums modulo Prime Powers

where p is a prime power with m ≥ 2, χ is a multiplicative character (mod p), epm(·) is the additive character, epm(x) = e 2πix pm , and f, g are rational functions with integer coefficients. It is understood, that the sum is only over values of x for which g and f and both defined as functions on Z/(p), and g is nonzero (mod p). The sum is trivial if f and g are both constants, so we shall alw...

متن کامل

Combinatorial Congruences modulo Prime Powers

Let p be any prime, and let α and n be nonnegative integers. Let r ∈ Z and f(x) ∈ Z[x]. We establish the congruence p f ∑ k≡r (mod pα) (n k ) (−1)f ( k − r pα ) ≡ 0 ( mod p ∑∞ i=α n/p i ) (motivated by a conjecture arising from algebraic topology) and obtain the following vast generalization of Lucas’ theorem: If α is greater than one, and l, s, t are nonnegative integers with s, t < p, then 1 ...

متن کامل

Binomial Character Sums modulo Prime Powers

We show that the binomial and related multiplicative character sums p ∑ x=1 (x,p)=1 χ(x(Ax +B)), p ∑ x=1 χ1(x)χ2(Ax k +B), have a simple evaluation for large enough m (for m ≥ 2 if p ABk).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2001

ISSN: 0097-3165

DOI: 10.1006/jcta.2000.3069